Logic-Based Benders Decomposition
نویسندگان
چکیده
Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different from other generalized duals that have been proposed. The approach is illustrated by working out the details for propositional satisfiability and 0-1 programming problems. Computational tests are carried out for the latter, but the most promising contribution of logic-based Benders may be to provide a framework for combining optimization and constraint programming methods. ∗This research was partially supported by U.S. Office of Naval Research Grant N0001495-1-0517 and by the Engineering Design Research Center at Carnegie Mellon University, an Engineering Research Center of the National Science Foundation, under grant EEC8943164.
منابع مشابه
Checking-Up on Branch-and-Check
Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasible solution of the master problem rather than only at an optimal solution. We perform the first systematic empirical comparison of logic-based Benders decomposition and branchand-check. On four problem types the results indica...
متن کاملSingle-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.
متن کاملMixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
A recent paper by Heinz and Beck (CPAIOR 2012) found that mixed integer software has become competitive with or superior to logic-based Benders decomposition for the solution of facility assignment and scheduling problems. Their implementation of Benders differs, however, from that described in the literature they cite and therefore results in much slower performance than previously reported. W...
متن کاملFull-load route planning for balancing bike sharing systems by logic-based benders decomposition
متن کامل
Benders decomposition in Constraint Programming
Recent work have exhibited specific structure among combinatorial problem instances that could be used to speed up search or to help users understand the dynamic and static intimate structure of the problem being solved. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. This paper presents how Benders dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995